Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms
نویسندگان
چکیده
We present a method based on symbolic-numeric reduction to geometric involutive form to compute the primary component and a basis of Max Noether space of a polynomial system at an isolated singular solution. The singular solution can be known exactly or approximately. If the singular solution is known with limited accuracy, then we propose a generalized quadratic Newton iteration to refine it to high accuracy.
منابع مشابه
Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
We briefly survey several existing methods for solving polynomial system with inexact coefficients, then introduce our new symbolic-numeric method which is based on the geometric (Jet) theory of partial differential equations. The method is stable and robust. Numerical experiments illustrate the performance of the new method.
متن کاملSolving Systems of Polynomial
Current geometric and solid modeling systems use semi-algebraic sets for deening the boundaries of solid objects, curves and surfaces, geometric constraints with mating relationship in a mechanical assembly, physical contacts between objects, collision detection. It turns out that performing many of the geometric operations on the solid boundaries or interacting with geometric constraints is re...
متن کاملReduction of Systems of Nonlinear Partial Diierential Equations to Simpliied Involutive Forms
We describe the rif algorithm which uses a nite number of diierentiations and algebraic operations to simplify analytic nonlinear systems of partial diierential equations to what we call reduced involutive form. This form includes the integrability conditions of the system and satisses a constant rank condition. The algorithm is useful for classifying initial value problems for determined pde s...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملComputing Isolated Singular Solutions of Polynomial Systems: Case of Breadth One
We present a symbolic-numeric method to refine an approximate isolated singular solution x̂ = (x̂1, . . . , x̂n) of a polynomial system F = {f1, . . . , fn}, when the Jacobian matrix of F evaluated at x̂ has corank one approximately. Our new approach is based on the regularized Newton iteration and the computation of differential conditions satisfied at the approximate singular solution. The size o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 47 شماره
صفحات -
تاریخ انتشار 2012